41 research outputs found
The Arbitrarily Varying Broadcast Channel with Degraded Message Sets with Causal Side Information at the Encoder
In this work, we study the arbitrarily varying broadcast channel (AVBC), when
state information is available at the transmitter in a causal manner. We
establish inner and outer bounds on both the random code capacity region and
the deterministic code capacity region with degraded message sets. The capacity
region is then determined for a class of channels satisfying a condition on the
mutual informations between the strategy variables and the channel outputs. As
an example, we consider the arbitrarily varying binary symmetric broadcast
channel with correlated noises. We show cases where the condition holds, hence
the capacity region is determined, and other cases where there is a gap between
the bounds.Comment: arXiv admin note: substantial text overlap with arXiv:1701.0334
The Arbitrarily Varying Relay Channel
We study the arbitrarily varying relay channel, and establish the cutset
bound and partial decode-forward bound on the random code capacity. We further
determine the random code capacity for special cases. Then, we consider
conditions under which the deterministic code capacity is determined as well.Comment: arXiv admin note: text overlap with arXiv:1701.0334
Channels with Cooperation Links that May Be Absent
It is well known that cooperation between users in a communication network
can lead to significant performance gains. A common assumption in past works is
that all the users are aware of the resources available for cooperation, and
know exactly to what extent these resources can be used. Unfortunately, in many
modern communication networks the availability of cooperation links cannot be
guaranteed a priori, due to the dynamic nature of the network. In this work a
family of models is suggested where the cooperation links may or may not be
present. Coding schemes are devised that exploit the cooperation links if they
are present, and can still operate (although at reduced rates) if cooperation
is not possible.Comment: Accepted for publication in the IEEE transaction on Information
Theory, June 201
Relay Channels with Unreliable Helpers
The relay channel with unreliable helper is introduced and studied. The model
is that of a classical relay channel where the input from the relay to the
channel has an extra primitive link whose presence is not assured a priori. The
extra link represents a helper who may decide not to cooperate in transmission.
The goal is to devise robust coding schemes that exploit all the relay links
when they are present, but can also operate, possibly at reduced rates, when
the extra primitive link (helper) is absent. The capacity region of this class
of problems is defined, and fully characterized for degraded relay channels.
The degraded Gaussian relay channel with unreliable relay link is solved.Comment: 9 pages, 4 figures. Part of the results were presented at the 2023
International Symposium on Information Theory, June 25-30 2023, Taipei,
Taiwa